<?xml version="1.0" encoding="ISO-8859-1"?>
<rss version="2.0">
	<channel>
		<title>Economics and Computation Seminar Series</title>
		<link>http://www.cs.ox.ac.uk/seminars/</link>
		<description><p>This interdisciplinary seminar series covers topics at the intersection of computer science, economics, and mathematics - in particular, computational social choice and algorithmic game theory. Join us for exciting talks and engaging discussions! Seminars usually take place on Fridays at 2pm, unless stated otherwise. For additional reminders, please contact Nicholas to be added to the seminar mailing list.</p></description>
		<language>en-gb</language>
		<ttl>360</ttl>
		<pubDate>Thu, 15 Oct 2026 11:39:26 GMT</pubDate>
		<lastBuildDate>Thu, 15 Oct 2026 11:39:26 GMT</lastBuildDate>
		<category>Economics and Computation Seminar Series</category>
		<docs>http://blogs.law.harvard.edu/tech/rss/</docs>
		<item>
			<title>Proportional Hierarchical Clustering. Leon Kellerhals (TU Clausthal)</title>
			<link>http://www.cs.ox.ac.uk/seminars/2859.html</link>
			<description>&#x3c;p&#x3e;Hierarchical clustering represents data at multiple levels of granularity, but proportional fairness is traditionally only defined for a single partition. We therefore study how it can be extended to an entire hierarchy. Building on prior work on proportional clustering, we introduce two notions: the local core, which requires proportional fairness at each split, and the global core, which requires it at every partition in the hierarchy. We study both notions under the assumption that an agent&#x27;s loss (disutility) for a clustering is the maximum distance to other members of their cluster. We show that the two core notions are incomparable and that standard agglomerative clustering techniques fail to satisfy them. However, under the maximum loss objective, a hierarchical clustering in the local core always exists. On the way, we resolve an open question from Caragiannis et al. (2024) by showing that there always exists a non-centroid clustering in the core for k = 2, whereas for k &#x26;ge&#x3b; 3 the core can be empty (even for Euclidean distances). For the global core, we show that even arbitrary approximations of it need not exist. However, doubling the coalition size threshold allows us to compute an outcome in the global 16-core for maximum-loss and global 8n-core for average-loss, where n is the number of data points.&#x3c;br /&#x3e;This is joint work with Robert Bredereck, Eva Deltl, and Jannik Peters.&#x3c;/p&#x3e;
&#x3c;br/&#x3e;Room 441</description>
			<guid isPermaLink="false">Economics and Computation Seminar Series oucl-seminar-Economics and Computation Seminar Series-2859</guid>
			<pubDate>Thu, 15 Oct 2026 11:39:26 GMT</pubDate>
		</item>
	</channel>
</rss>
